Circuit complexity

Results: 364



#Item
331AC / Circuit complexity / Transport

City of Springfield Corporation Counsel Docket Sheet 8:30 a.m.-October 9, 2013- City Council Chambers INSPECTOR CASE NO. ADDRESS DEFENDANT

Add to Reading List

Source URL: services.springfield.il.us

Language: English - Date: 2013-12-04 09:17:36
332AC / Circuit complexity / Transport

City of Springfield Corporation Counsel Docket Sheet 8:30 a.m.-September 25, 2013- City Council Chambers INSPECTOR CASE NO. ADDRESS DEFENDANT

Add to Reading List

Source URL: services.springfield.il.us

Language: English - Date: 2013-12-04 09:17:36
333Transport / AC / Circuit complexity / Carr

City of Springfield Corporation Counsel Docket Sheet 8:30 a.m.-April 23, 2014- City Council Chambers INSPECTOR CASE NO. ADDRESS DEFENDANT

Add to Reading List

Source URL: services.springfield.il.us

Language: English - Date: 2014-04-30 11:32:52
334AC / Circuit complexity / Transport

City of Springfield Corporation Counsel Docket Sheet 8:30 a.m.-March 26, 2014- City Council Chambers INSPECTOR CASE NO. ADDRESS DEFENDANT

Add to Reading List

Source URL: services.springfield.il.us

Language: English - Date: 2014-03-21 09:40:42
335Circuit complexity / Computational complexity theory / Boolean algebra / Complexity classes / Implicant / Logic in computer science / Boolean circuit / Circuit / ACC0 / Theoretical computer science / Mathematics / Applied mathematics

On the Incompressibility of Monotone DNFs Matthias P. Krieger∗ Johann Wolfgang Goethe-Universit¨at Frankfurt am Main Institut f¨ ur Informatik Lehrstuhl f¨

Add to Reading List

Source URL: lovelace.thi.informatik.uni-frankfurt.de

Language: English - Date: 2010-11-03 11:40:59
336Transport / AC / Circuit complexity / Morrell

City of Springfield Corporation Counsel Docket Sheet 8:30 a.m.-October 16, 2013- City Council Chambers INSPECTOR CASE NO. ADDRESS DEFENDANT

Add to Reading List

Source URL: services.springfield.il.us

Language: English - Date: 2013-12-04 09:17:36
337Quantum algorithms / Models of computation / Quantum computer / Quantum walk / Quantum circuit / Computational complexity theory / Algorithm / Randomized algorithm / Qubit / Theoretical computer science / Applied mathematics / Quantum information science

Quantum random walk search on satisfiability problems Stephan Hoyer Swarthmore College Department of Physics and Astronomy April 1, 2008

Add to Reading List

Source URL: stephanhoyer.com

Language: English - Date: 2011-01-09 01:28:18
338Computational complexity theory / Propositional calculus / Logic in computer science / Boolean algebra / Circuit complexity / Tautology / Switching lemma / Logical connective / Proof complexity / Theoretical computer science / Mathematics / Logic

An Introduction to Proof Complexity, Part I. Pavel Pudl´ak

Add to Reading List

Source URL: www.math.uni-heidelberg.de

Language: English - Date: 2009-07-30 07:35:13
339Complexity classes / Model theory / Circuit complexity / Predicate logic / Semantics / FO / BIT predicate / AC0 / Predicate / Theoretical computer science / Mathematics / Applied mathematics

A Purely Logical Characterization of Circuit Uniformity (Extended Draft) Steven Lindell †

Add to Reading List

Source URL: www.haverford.edu

Language: English - Date: 2013-03-11 14:31:15
340Circuit complexity / NC

MSAD/RSU  54  Committee  Meeting     Agenda  for  March  17,  2011      

Add to Reading List

Source URL: www.msad54.org

Language: English - Date: 2011-02-17 11:33:34
UPDATE